home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Loadstar 12
/
012.d81
/
t.three deep.boo
< prev
next >
Wrap
Text File
|
2022-08-26
|
1KB
|
91 lines
*** THREE DEEP ***
Written by: Thomas Foster
Alpha Order Sort
Commodore Microcomputers, June 1985
Page 6
Here is a great routine to speed up
those long, never-ending sorts. It is
based upon the Distribution Counting
method of sorting. The original
Distribution sort only sorted by the
first character in an element. This
version, however, sorts by the first
three characters of an element.
To use this routine, tack it into
your own program. Then, merely GOSUB
to it. You will be amazed at the
speed of the sort. You must have
already dimensioned and initialized
the arrays A$(), B$(), and C(). If
you only want to sort A$(), simply
remove all references to B$(), BB$(),
BC$(), BD$(), C(), CC(), CD(), and
CE(). The lines which will be
affected by this are 7010, 7055, 7110,
7155, 8010, and 8055.
*** NOTE ***
Because of the nature of this program,
you can not RUN it from the LOADSTAR
environment. This program is intended
to be used only as a sub-routine.
This program is copyrighted by
Microcomputers Magazine. All rights
to it are reserved. LOADSTAR has
relieved you from the burden of keying
in this program.
For more complete
information about this program, refer
to the June 1985 issue of
Microcomputers Magazine.
>Files used: THREE DEEP
--------------------------------------